Combinatorial Optimization and Applications
نویسندگان
چکیده
منابع مشابه
Considering Stochastic and Combinatorial Optimization
Here, issues connected with characteristic stochastic practices are considered. In the first part, the plausibility of covering the arrangements of an improvement issue on subjective subgraphs is studied. The impulse for this strategy is a state where an advancement issue must be settled as often as possible for discretionary illustrations. Then, a preprocessing stage is considered that would q...
متن کاملGuest Editorial: Advanced Combinatorial Optimization and Applications
Biographical notes: Dr. Said Ben Messaoud received his Diploma of “Maîtrise” in Applied Mathematics from the Faculty of Sciences of Monastir in 1998, his MS degree from the INPGGrenoble, in 2000 and his PhD degree in Optimization in 2004 from the Technology University of Troyes. He is a Assistant Professor at the Higher Institute for Informatics and Mathematics of Monastir-Tunisia. His research...
متن کاملCombinatorial Optimization Problems in Engineering Applications
This paper deals with several combinatorial optimization problems. The most challenging such problem is the quadratic assignment problem. It is considered in both two dimensions (QAP) and in three dimensions (Q3AP) and in the context of communication engineering. Semidefinite relaxations are used to derive lower bounds for the optimum while heuristics are applied to either find upper bounds or ...
متن کاملNeural techniques for combinatorial optimization with applications
After more than a decade of research, there now exist several neural-network techniques for solving NP-hard combinatorial optimization problems. Hopfield networks and self-organizing maps are the two main categories into which most of the approaches can be divided. Criticism of these approaches includes the tendency of the Hopfield network to produce infeasible solutions, and the lack of genera...
متن کاملNeural Network Applications F1.3 Combinatorial optimization
Combinatorial optimization problems are frequently encountered in a broad range of disciplines from economics to engineering. These problems are notoriously difficult to solve for many applications, especially when the number of free parameters is large. In many situations, high-performance computers are required to solve optimization problems in practical times. Many of the problems solved by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.09.047